On the Minimal Free Resolution of General $k$-Gonal Curves

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE MINIMAL FREE RESOLUTION OF n + 1 GENERAL FORMS

Let R = k[x 1 ,. .. , xn] and let I be the ideal of n + 1 generically chosen forms of degrees d 1 ≤ · · · ≤ d n+1. We give the precise graded Betti numbers of R/I in the following cases: • n = 3; • n = 4 and 5 i=1 d i is even; • n = 4, 5 i=1 d i is odd and d 2 + d 3 + d 4 < d 1 + d 5 + 4; • n is even and all generators have the same degree, a, which is even; • (n+1 i=1 d i) − n is even and d 2 ...

متن کامل

Syzygies of 5-Gonal Canonical Curves

We show that for 5-gonal curves of odd genus g ≥ 13 and even genus g ≥ 28 the ⌈ g−1 2 ⌉-th syzygy module of the curve is not determined by the syzygies of the scroll swept out by the special pencil of degree 5. 2010 Mathematics Subject Classification: 13D02,14H51

متن کامل

Very special divisors on 4-gonal real algebraic curves

Given a real curve, we study special linear systems called “very special” for which the dimension does not satisfy a Clifford type inequality. We classify all these very special linear systems when the gonality of the curve is small.

متن کامل

- Invariant and the Minimal Free Resolution Huy

In recent years, two different multigraded variants of Castelnuovo-Mumford regularity have been developed, namely multigraded regularity, defined by the vanishing of multigraded pieces of local cohomology modules, and the resolution regularity vector, defined by the multi-degrees in a minimal free resolution. In this paper, we study the relationship between multigraded regularity and the resolu...

متن کامل

COMPUTING THE BRAID MONODROMY OF COMPLETELY REDUCIBLE n-GONAL CURVES

Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the rectangular braid diagram (RBD) method is proposed to compute the braid monodromy of a completely reducible n-gonal curve, i.e. the curves in the form (y−y1(x))...(y−yn(x)) = 0 where n ∈ Z+ and yi ∈ C[x]. Also, an algorithm is presented to compute the Alexander polynomial of these curve comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 1997

ISSN: 0035-7596

DOI: 10.1216/rmjm/1181071951